#include<iostream>
#include<vector>

using namespace std;

class Solution {
    vector<int>ret;
    vector<int>index;
    int tmpnums[500010];
    int tmpindex[500010];
public:
    vector<int> countSmaller(vector<int>& nums) {
        int n = nums.size();
        ret.resize(n);
        index.resize(n);
        for (int i = 0; i < n; i++)
        {
            index[i] = i;
        }
        mergeSort(nums, 0, n - 1);
        return ret;

    }
    void mergeSort(vector<int>& nums, int left, int right)
    {
        if (left >= right)
        {
            return;
        }

        int mid = left + (right - left) / 2;
        mergeSort(nums, left, mid);
        mergeSort(nums, mid + 1, right);

        int cur1 = left, cur2 = mid + 1, i = 0;
        while (cur1 <= mid && cur2 <= right)
        {
            if (nums[cur1] <= nums[cur2])
            {
                tmpnums[i] = nums[cur2];
                tmpindex[i++] = index[cur2++];
            }
            else
            {
                ret[index[cur1]] += right - cur2 + 1;
                tmpnums[i] = nums[cur1];
                tmpindex[i++] = index[cur1++];
            }
        }

        while (cur1 <= mid)
        {
            tmpnums[i] = nums[cur1];
            tmpindex[i++] = index[cur1++];

        }
        while (cur2 <= right)
        {
            tmpnums[i] = nums[cur2];
            tmpindex[i++] = index[cur2++];
        }

        for (int j = left; j <= right; j++)
        {
            nums[j] = tmpnums[j - left];
            index[j] = tmpindex[j - left];
        }
    }
};

int main()
{
    return 0;
}